A PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS
نویسندگان
چکیده
منابع مشابه
A path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملA path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملPath-following primal-dual interior-point methods for shape optimization of stationary flow problems
We consider shape optimization of Stokes flow in channels where the objective is to design the lateral walls of the channel in such a way that a desired velocity profile is achieved. This amounts to the solution of a PDE constrained optimization problem with the state equation given by the Stokes system and the design variables being the control points of a Bézier curve representation of the la...
متن کاملA polynomial path-following interior point algorithm for general linear complementarity problems
Linear Complementarity Problems (LC Ps) belong to the class of NP-complete problems. Therefore we cannot expect a polynomial time solution method for LC Ps without requiring some special property of the coefficient matrix. Our aim is to construct interior point algorithms which, according to the duality theorem in EP (Existentially Polynomialtime) form, in polynomial time either give a solution...
متن کاملa path following interior-point algorithm for semidefinite optimization problem based on new kernel function
in this paper, we deal to obtain some new complexity results for solving semidefinite optimization (sdo) problem by interior-point methods (ipms). we define a new proximity function for the sdo by a new kernel function. furthermore we formulate an algorithm for a primal dual interior-point method (ipm) for the sdo by using the proximity function and give its complexity analysis, and then we sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1987
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.30.181